Encoding LDPC Codes Using the Triangular Factorization
نویسنده
چکیده
An algorithm for encoding low-density parity check (LDPC) codes is investigated. The algorithm computes parity check symbols by solving a set of sparse equations, and the triangular factorization is employed to solve the equations efficiently. It is shown analytically and experimentally that the proposed algorithm is more efficient than the Richardson’s encoding algorithm if the code has a small gap. key words: LDPC codes, encoding algorithm, triangular factorization, sparse matrix
منابع مشابه
A Tutorial on Low Density Parity-Check Codes
− Low density parity-check codes are one of the hottest topics in coding theory nowadays. Equipped with very fast encoding and decoding algorithms (probabilistically,) LDPC are very attractive both theoretically and practically. In this paper, I present a throughout view of LDPC. I discuss in detail LDPC’s popular decoding algorithm: belief propagation. I also present some noticeable encoding a...
متن کاملA class of efficient-encoding generalized low-density parity-check codes
In this paper, we investigate an efficient encoding approach for generalized low-density (GLD) parity check codes, a generalization of Gallager’s low-density parity check (LDPC) codes. We propose a systematic approach to construct approximate upper triangular GLD parity check matrix which defines a class of efficientencoding GLD codes. It’s shown that such GLD codes have equally good performanc...
متن کاملA method of constructing the half-rate QC-LDPC codes with linear encoder, maximum column weight three and inevitable girth 26
This paper presents a method of constructing the half-rate irregular quasi-cyclic low-density parity-check codes which can provide linear encoding algorithm and their H-matrices may contain almost the least “1” elements comparing with H-matrices of all existing LDPC codes. This method shows that three kinds of special structural matrices, respectively named as S-matrix, M-matrix and A-matrix, a...
متن کاملA New Class of Irregular Low-Density Parity-Check Codes With Linear Encoding Complexity
In this paper we propose a new class of irregular low-density parity check (LDPC) codes with linear encoding complexity. We show that these codes offer performances compatible with irregular LDPC codes with randomly generated parity-check matrices. The non-systematic part of the paritycheck matrix has a simple triangular structure, which enables linear encoding, while the systematic part of the...
متن کاملAn Efficient Method to Construct Parity-Check Matrices for Recursively Encoding Spatially Coupled LDPC Codes †
Spatially coupled low-density parity-check (LDPC) codes have attracted considerable attention due to their promising performance. Recursive encoding of the codes with low delay and low complexity has been proposed in the literature but with constraints or restrictions. In this manuscript we propose an efficient method to construct parity-check matrices for recursively encoding spatially coupled...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 89-A شماره
صفحات -
تاریخ انتشار 2006